math/big.Int.abs (field)
394 uses
math/big (current package)
float.go#L604: if len(x.abs) == 0 {
float.go#L609: z.mant = z.mant.set(x.abs)
float.go#L1109: z.abs = z.abs.shl(x.mant, exp-allBits)
float.go#L1111: z.abs = z.abs.set(x.mant)
float.go#L1113: z.abs = z.abs.shr(x.mant, allBits-exp)
float.go#L1149: z.a.abs = z.a.abs.shl(x.mant, uint(x.exp-allBits))
float.go#L1150: z.b.abs = z.b.abs[:0] // == 1 (see Rat)
float.go#L1153: z.a.abs = z.a.abs.set(x.mant)
float.go#L1154: z.b.abs = z.b.abs[:0] // == 1 (see Rat)
float.go#L1157: z.a.abs = z.a.abs.set(x.mant)
float.go#L1158: t := z.b.abs.setUint64(1)
float.go#L1159: z.b.abs = t.shl(t, uint(allBits-x.exp))
int.go#L27: abs nat // absolute value of the integer
int.go#L39: if len(x.abs) == 0 {
int.go#L55: z.abs = z.abs.setUint64(uint64(x))
int.go#L62: z.abs = z.abs.setUint64(x)
int.go#L75: z.abs = z.abs.set(x.abs)
int.go#L87: return x.abs
int.go#L96: z.abs = nat(abs).norm()
int.go#L111: z.neg = len(z.abs) > 0 && !z.neg // 0 has no sign
int.go#L121: z.abs = z.abs.add(x.abs, y.abs)
int.go#L125: if x.abs.cmp(y.abs) >= 0 {
int.go#L126: z.abs = z.abs.sub(x.abs, y.abs)
int.go#L129: z.abs = z.abs.sub(y.abs, x.abs)
int.go#L132: z.neg = len(z.abs) > 0 && neg // 0 has no sign
int.go#L142: z.abs = z.abs.add(x.abs, y.abs)
int.go#L146: if x.abs.cmp(y.abs) >= 0 {
int.go#L147: z.abs = z.abs.sub(x.abs, y.abs)
int.go#L150: z.abs = z.abs.sub(y.abs, x.abs)
int.go#L153: z.neg = len(z.abs) > 0 && neg // 0 has no sign
int.go#L164: z.abs = z.abs.sqr(x.abs)
int.go#L168: z.abs = z.abs.mul(x.abs, y.abs)
int.go#L169: z.neg = len(z.abs) > 0 && x.neg != y.neg // 0 has no sign
int.go#L191: z.abs = z.abs.mulRange(uint64(a), uint64(b))
int.go#L212: z.abs, _ = z.abs.div(nil, x.abs, y.abs)
int.go#L213: z.neg = len(z.abs) > 0 && x.neg != y.neg // 0 has no sign
int.go#L221: _, z.abs = nat(nil).div(z.abs, x.abs, y.abs)
int.go#L222: z.neg = len(z.abs) > 0 && x.neg // 0 has no sign
int.go#L239: z.abs, r.abs = z.abs.div(r.abs, x.abs, y.abs)
int.go#L240: z.neg, r.neg = len(z.abs) > 0 && x.neg != y.neg, len(r.abs) > 0 && x.neg // 0 has no sign
int.go#L266: if z == y || alias(z.abs, y.abs) {
int.go#L298: if z == y || alias(z.abs, y.abs) {
int.go#L329: r = x.abs.cmp(y.abs)
int.go#L348: return x.abs.cmp(y.abs)
int.go#L374: v := int64(low64(x.abs))
int.go#L384: return low64(x.abs)
int.go#L389: if len(x.abs) <= 64/_W {
int.go#L390: w := int64(low64(x.abs))
int.go#L398: return !x.neg && len(x.abs) <= 64/_W
int.go#L444: z.abs = z.abs.setBytes(buf)
int.go#L453: buf := make([]byte, len(x.abs)*_S)
int.go#L454: return buf[x.abs.bytes(buf):]
int.go#L466: x.abs.bytes(buf)
int.go#L473: return x.abs.bitLen()
int.go#L479: return x.abs.trailingZeroBits()
int.go#L490: xWords := x.abs
int.go#L492: if m == nil || len(m.abs) == 0 {
int.go#L500: xWords = inverse.abs
int.go#L502: yWords := y.abs
int.go#L506: mWords = m.abs // m.abs may be nil for m == 0
int.go#L509: z.abs = z.abs.expNN(xWords, yWords, mWords)
int.go#L510: z.neg = len(z.abs) > 0 && x.neg && len(yWords) > 0 && yWords[0]&1 == 1 // 0 has no sign
int.go#L513: z.abs = z.abs.sub(mWords, z.abs) // z == x**y mod |m| && 0 <= z < |m|
int.go#L532: if len(a.abs) == 0 || len(b.abs) == 0 {
int.go#L533: lenA, lenB, negA, negB := len(a.abs), len(b.abs), a.neg, b.neg
int.go#L576: m := len(B.abs) // m >= 2
int.go#L577: n := len(A.abs) // n >= m >= 2
int.go#L580: h := nlz(A.abs[n-1])
int.go#L581: a1 = A.abs[n-1]<<h | A.abs[n-2]>>(_W-h)
int.go#L585: a2 = B.abs[n-1]<<h | B.abs[n-2]>>(_W-h)
int.go#L587: a2 = B.abs[n-2] >> (_W - h)
int.go#L625: t.abs = t.abs.setWord(u0)
int.go#L626: s.abs = s.abs.setWord(v0)
int.go#L633: r.abs = r.abs.setWord(u1)
int.go#L634: q.abs = q.abs.setWord(v1)
int.go#L692: if A.abs.cmp(B.abs) < 0 {
int.go#L698: for len(B.abs) > 1 {
int.go#L722: if len(B.abs) > 0 {
int.go#L724: if len(A.abs) > 1 {
int.go#L728: if len(B.abs) > 0 {
int.go#L730: aWord, bWord := A.abs[0], B.abs[0]
int.go#L744: t.abs = t.abs.setWord(ua)
int.go#L745: s.abs = s.abs.setWord(va)
int.go#L758: A.abs[0] = aWord
int.go#L796: if n.neg || len(n.abs) == 0 {
int.go#L797: z.abs = nil
int.go#L800: z.abs = z.abs.random(rnd, n.abs, n.abs.bitLen())
int.go#L839: if len(y.abs) == 0 || y.abs[0]&1 == 0 {
int.go#L863: if len(a.abs) == 0 {
int.go#L867: if len(a.abs) == 0 {
int.go#L873: s := a.abs.trailingZeroBits()
int.go#L875: bmod8 := b.abs[0] & 7
int.go#L883: if b.abs[0]&3 == 3 && c.abs[0]&3 == 3 {
int.go#L934: e := s.abs.trailingZeroBits()
int.go#L995: case p.abs[0]%4 == 3:
int.go#L998: case p.abs[0]%8 == 5:
int.go#L1009: z.abs = z.abs.shl(x.abs, n)
int.go#L1018: t := z.abs.sub(x.abs, natOne) // no underflow because |x| > 0
int.go#L1020: z.abs = t.add(t, natOne)
int.go#L1025: z.abs = z.abs.shr(x.abs, n)
int.go#L1035: if len(x.abs) > 0 {
int.go#L1036: return uint(x.abs[0] & 1) // bit 0 is same for -x
int.go#L1044: t := nat(nil).sub(x.abs, natOne)
int.go#L1048: return x.abs.bit(uint(i))
int.go#L1060: t := z.abs.sub(x.abs, natOne)
int.go#L1062: z.abs = t.add(t, natOne)
int.go#L1063: z.neg = len(z.abs) > 0
int.go#L1066: z.abs = z.abs.setBit(x.abs, uint(i), b)
int.go#L1076: x1 := nat(nil).sub(x.abs, natOne)
int.go#L1077: y1 := nat(nil).sub(y.abs, natOne)
int.go#L1078: z.abs = z.abs.add(z.abs.or(x1, y1), natOne)
int.go#L1084: z.abs = z.abs.and(x.abs, y.abs)
int.go#L1095: y1 := nat(nil).sub(y.abs, natOne)
int.go#L1096: z.abs = z.abs.andNot(x.abs, y1)
int.go#L1106: x1 := nat(nil).sub(x.abs, natOne)
int.go#L1107: y1 := nat(nil).sub(y.abs, natOne)
int.go#L1108: z.abs = z.abs.andNot(y1, x1)
int.go#L1114: z.abs = z.abs.andNot(x.abs, y.abs)
int.go#L1121: x1 := nat(nil).sub(x.abs, natOne)
int.go#L1122: z.abs = z.abs.add(z.abs.or(x1, y.abs), natOne)
int.go#L1128: y1 := nat(nil).sub(y.abs, natOne)
int.go#L1129: z.abs = z.abs.and(x.abs, y1)
int.go#L1139: x1 := nat(nil).sub(x.abs, natOne)
int.go#L1140: y1 := nat(nil).sub(y.abs, natOne)
int.go#L1141: z.abs = z.abs.add(z.abs.and(x1, y1), natOne)
int.go#L1147: z.abs = z.abs.or(x.abs, y.abs)
int.go#L1158: y1 := nat(nil).sub(y.abs, natOne)
int.go#L1159: z.abs = z.abs.add(z.abs.andNot(y1, x.abs), natOne)
int.go#L1169: x1 := nat(nil).sub(x.abs, natOne)
int.go#L1170: y1 := nat(nil).sub(y.abs, natOne)
int.go#L1171: z.abs = z.abs.xor(x1, y1)
int.go#L1177: z.abs = z.abs.xor(x.abs, y.abs)
int.go#L1188: y1 := nat(nil).sub(y.abs, natOne)
int.go#L1189: z.abs = z.abs.add(z.abs.xor(x.abs, y1), natOne)
int.go#L1198: z.abs = z.abs.sub(x.abs, natOne)
int.go#L1204: z.abs = z.abs.add(x.abs, natOne)
int.go#L1216: z.abs = z.abs.sqrt(x.abs)
intconv.go#L25: return string(x.abs.itoa(x.neg, base))
intconv.go#L34: return append(buf, x.abs.itoa(x.neg, base)...)
intconv.go#L119: digits := x.abs.utoa(base)
intconv.go#L190: z.abs, base, _, err = z.abs.scan(r, base, false)
intconv.go#L194: z.neg = len(z.abs) > 0 && neg // 0 has no sign
intmarsh.go#L22: buf := make([]byte, 1+len(x.abs)*_S) // extra byte for version and sign bit
intmarsh.go#L23: i := x.abs.bytes(buf) - 1 // i >= 0
intmarsh.go#L44: z.abs = z.abs.setBytes(buf[1:])
intmarsh.go#L53: return x.abs.itoa(x.neg, 10), nil
prime.go#L39: if x.neg || len(x.abs) == 0 {
prime.go#L48: w := x.abs[0]
prime.go#L49: if len(x.abs) == 1 && w < 64 {
prime.go#L63: rA = uint32(x.abs.modW(primesA))
prime.go#L64: rB = uint32(x.abs.modW(primesB))
prime.go#L66: r := x.abs.modW((primesA * primesB) & _M)
prime.go#L78: return x.abs.probablyPrimeMillerRabin(n+1, true) && x.abs.probablyPrimeLucas()
prime.go#L171: intD := &Int{abs: d}
prime.go#L172: intN := &Int{abs: n}
rat.go#L274: b := x.b.abs
rat.go#L278: f, exact = quotToFloat32(x.a.abs, b)
rat.go#L290: b := x.b.abs
rat.go#L294: f, exact = quotToFloat64(x.a.abs, b)
rat.go#L305: babs := b.abs
rat.go#L309: if &z.a == b || alias(z.a.abs, babs) {
rat.go#L312: z.a.abs = z.a.abs.set(a.abs)
rat.go#L313: z.b.abs = z.b.abs.set(babs)
rat.go#L328: z.b.abs = z.b.abs.setUint64(uint64(b))
rat.go#L335: z.b.abs = z.b.abs.setWord(1)
rat.go#L342: z.b.abs = z.b.abs.setWord(1)
rat.go#L349: z.b.abs = z.b.abs.setWord(1)
rat.go#L359: if len(z.b.abs) == 0 {
rat.go#L360: z.b.abs = z.b.abs.setWord(1)
rat.go#L375: z.a.neg = len(z.a.abs) > 0 && !z.a.neg // 0 has no sign
rat.go#L382: if len(x.a.abs) == 0 {
rat.go#L386: z.a.abs, z.b.abs = z.b.abs, z.a.abs
rat.go#L402: return len(x.b.abs) == 0 || x.b.abs.cmp(natOne) == 0
rat.go#L422: if len(x.b.abs) == 0 {
rat.go#L426: return &Int{abs: nat{1}}
rat.go#L433: case len(z.a.abs) == 0:
rat.go#L437: case len(z.b.abs) == 0:
rat.go#L439: z.b.abs = z.b.abs.setWord(1)
rat.go#L446: z.a.abs, _ = z.a.abs.div(nil, z.a.abs, f.abs)
rat.go#L447: z.b.abs, _ = z.b.abs.div(nil, z.b.abs, f.abs)
rat.go#L476: z.abs = z.abs.mul(x.abs, f)
rat.go#L488: a.scaleDenom(&x.a, y.b.abs)
rat.go#L489: b.scaleDenom(&y.a, x.b.abs)
rat.go#L496: a1.scaleDenom(&x.a, y.b.abs)
rat.go#L497: a2.scaleDenom(&y.a, x.b.abs)
rat.go#L499: z.b.abs = mulDenom(z.b.abs, x.b.abs, y.b.abs)
rat.go#L506: a1.scaleDenom(&x.a, y.b.abs)
rat.go#L507: a2.scaleDenom(&y.a, x.b.abs)
rat.go#L509: z.b.abs = mulDenom(z.b.abs, x.b.abs, y.b.abs)
rat.go#L518: z.a.abs = z.a.abs.sqr(x.a.abs)
rat.go#L519: if len(x.b.abs) == 0 {
rat.go#L520: z.b.abs = z.b.abs.setWord(1)
rat.go#L522: z.b.abs = z.b.abs.sqr(x.b.abs)
rat.go#L527: z.b.abs = mulDenom(z.b.abs, x.b.abs, y.b.abs)
rat.go#L534: if len(y.a.abs) == 0 {
rat.go#L538: a.scaleDenom(&x.a, y.b.abs)
rat.go#L539: b.scaleDenom(&y.a, x.b.abs)
rat.go#L540: z.a.abs = a.abs
rat.go#L541: z.b.abs = b.abs
ratconv.go#L71: if z.b.abs, _, _, err = z.b.abs.scan(r, 0, false); err != nil {
ratconv.go#L78: if len(z.b.abs) == 0 {
ratconv.go#L96: z.a.abs, base, fcount, err = z.a.abs.scan(r, 0, true)
ratconv.go#L115: if len(z.a.abs) == 0 {
ratconv.go#L181: pow5 := z.b.abs.expNN(natFive, nat(nil).setWord(Word(n)), nil) // use underlying array of z.b.abs
ratconv.go#L183: z.a.abs = z.a.abs.mul(z.a.abs, pow5)
ratconv.go#L184: z.b.abs = z.b.abs.setWord(1)
ratconv.go#L186: z.b.abs = pow5
ratconv.go#L189: z.b.abs = z.b.abs.setWord(1)
ratconv.go#L197: z.a.abs = z.a.abs.shl(z.a.abs, uint(exp2))
ratconv.go#L199: z.b.abs = z.b.abs.shl(z.b.abs, uint(-exp2))
ratconv.go#L202: z.a.neg = neg && len(z.a.abs) > 0 // 0 has no sign
ratconv.go#L310: if len(x.b.abs) != 0 {
ratconv.go#L345: q, r := nat(nil).div(nat(nil), x.a.abs, x.b.abs)
ratconv.go#L353: r, r2 := r.div(nat(nil), r, x.b.abs)
ratconv.go#L357: if x.b.abs.cmp(r2) <= 0 {
ratmarsh.go#L23: buf := make([]byte, 1+4+(len(x.a.abs)+len(x.b.abs))*_S) // extra bytes for version and sign bit (1), and numerator length (4)
ratmarsh.go#L24: i := x.b.abs.bytes(buf)
ratmarsh.go#L25: j := x.a.abs.bytes(buf[:i])
ratmarsh.go#L55: z.a.abs = z.a.abs.setBytes(buf[j:i])
ratmarsh.go#L56: z.b.abs = z.b.abs.setBytes(buf[i:])